Kotlin Computational Geometry/io.github.cponfick.kompgeom.algorithms.closestpair/ClosestPairNaive

ClosestPairNaive

class ClosestPairNaive<V : Vector<V>>(input: Collection<V>) : IClosestPair<V> (source)

Closest Pair algorithm using the Divide and Conquer approach. This implementation sorts the points by x and y coordinates and recursively finds the closest pair.

Constructors

Link copied to clipboard
constructor(input: Collection<V>)

initializes the algorithm with a collection of points.

Types

Link copied to clipboard

Functions

Link copied to clipboard
open override fun run(): Result<V>

Runs the algorithm and returns the output.